/** 计算二叉树的深度 */
function getTreeDepth(root) {
    if (root === null) {
        return 0;
    }

    leftDepth = getTreeDepth(root.left);

    rightDepth = getTreeDepth(root.right);

    return Math.max(leftDepth, rightDepth) + 1;
}